Cutting Trees and Piling Branches

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Branches in random recursive k-ary trees

In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.

متن کامل

Trees and Branches in Banach Spaces

An infinite dimensional notion of asymptotic structure is considered. This notion is developed in terms of trees and branches on Banach spaces. Every countably infinite countably branching tree T of a certain type on a space X is presumed to have a branch with some property. It is shown that then X can be embedded into a space with an FDD (Ei) so that all normalized sequences in X which are alm...

متن کامل

Linking and Cutting Spanning Trees

We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle graphs we prove that this approach significantly outperforms existing algorithms. For general graphs we obtain no analytical bounds, but experimental results ...

متن کامل

Cutting Recursive Autoencoder Trees

Deep Learning models enjoy considerable success in Natural Language Processing. While deep architectures produce useful representations that lead to improvements in various tasks, they are often difficult to interpret. This makes the analysis of learned structures particularly difficult. In this paper, we rely on empirical tests to see whether a particular structure makes sense. We present an a...

متن کامل

On Conditional Branches in Search Trees

Algorithms for efficiently finding optimal alphabetic decision trees for known probability distributions are well established and commonly used. However, such algorithms generally assume that the cost per decision is uniform and thus independent of the outcome of the decision. The few algorithms without this assumption instead use one cost if the decision outcome is “less than” and another cost...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of African Studies

سال: 1998

ISSN: 0065-4140,1884-5533

DOI: 10.11619/africa1964.1998.53_1